package bTree.LeetCode;

import javax.swing.tree.TreeNode;

public class 平衡二叉树 {
    public boolean isBalanced(TreeNode root) {
        if(root=null){
            return true;
        }
        return ifBalanced(root.left,root.right);
    }

    boolean ifBalanced(TreeNode left,TreeNode right){
        if(left==null&&right==null){
            return true;
        }
        if(left==null){
            if(right.left==null||right.right==null||right.left.left==null||right)
        }
    }

}